A Memetic Algorithm For Multi-level Redundancy Allocation Problem
نویسندگان
چکیده
Redundancy allocation problems (RAPs) have attracted much attention for the past thirty years due to its wide applications in improving the reliability of various engineering systems. Since RAP is an NP-hard problem and exact methods are only applicable to small instances, various heuristic and meta-heuristic methods have been proposed to solve it. In the literature, most studies on RAPs have been conducted for single-level systems. However, real-world engineering systems usually contain multiple levels. In this paper, the RAP on multi-level systems is investigated. A novel memetic algorithm (MA) is proposed to solve this problem. Two genetic operators, namely breadth-first crossover and breadth-first mutation, and a local search method are designed for the MA. Comprehensive experimental studies have shown that the proposed MA outperformed the state-of-the-art approach significantly on two representative examples.
منابع مشابه
A redundancy allocation problem with the choice of redundancy strategies by a memetic algorithm
This paper proposes an efficient algorithm based on memetic algorithm (MA) for a redundancy allocation problem without component mixing (RAPCM) in a series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general RAPCM assume that the type of a redundancy strategy for each subsystem is pre-determined and known a prior...
متن کاملThe Effects of Technical and Organizational Activities on Redundancy Allocation Problem with Choice of Selecting Redundancy Strategies Using the memetic algorithm
Redundancy allocation problem is one of most important problems in reliability area. This problem involves with the suitable redundancy levels under certain strategies to maximizing system reliability under some constraints. Many changes have been made on this problem to draw the problem near to real situations. Selecting the redundancy strategy, using different system configuration are some of...
متن کاملSolving a Redundancy Allocation Problem by a Hybrid Multi-objective Imperialist Competitive Algorithm
A redundancy allocation problem (RAP) is a well-known NP-hard problem that involves the selection of elements and redundancy levels to maximize the system reliability under various system-level constraints. In many practical design situations, reliability apportionment is complicated because of the presence of several conflicting objectives that cannot be combined into a single-objective functi...
متن کاملA Memtic genetic algorithm for a redundancy allocation problem
Abstract In general redundancy allocation problems the redundancy strategy for each subsystem is predetermined. Tavakkoli- Moghaddam presented a series-parallel redundancy allocation problem with mixing components (RAPMC) in which the redundancy strategy can be chosen for individual subsystems. In this paper, we present a bi-objective redundancy allocation when the redundancy strategies for...
متن کاملUsing NSGA II Algorithm for a Three Objectives Redundancy Allocation Problem with k-out-of-n Sub-Systems
in the new production systems, finding a way to improving the product and system reliability in design is a very important. The reliability of the products and systems may improve using different methods. One of this methods is redundancy allocation problem. In this problem by adding redundant component to sub-systems under some constraints, the reliability improved. In this paper we worked on ...
متن کاملGenetic Algorithm and Simulated Annealing for Redundancy Allocation Problem with Cold-standby Strategy
This paper presents a new mathematical model for a redundancyallocation problem (RAP) withcold-standby redundancy strategy and multiple component choices.The applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.Manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...
متن کامل